package DP;

/**
 * @author dx
 * @version 1.0
 * @date 2022/5/17 18:06
 * @description: 力扣 62 不同路径
 */
public class UniquePaths {
}
class UniquePaths_Sosution{
    public int uniquePaths(int m, int n) {
        int [][]dp = new int[m][n];
        for(int i = 0;i < m; i++){
            for(int j = 0;j < n;j++){
                if(i == 0 && j == 0) dp[i][j] = 1;
                else if(i == 0) dp[i][j] = dp[i][j-1];
                else if(j == 0) dp[i][j] = dp[i-1][j];
                else {
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
                }
            }
        }
        return dp[m-1][n-1];
    }
}